Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

Necessary conditions for multistationarity in discrete dynamical systems

R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation.     

关于矩阵和算子迹的一组不等式

给出关于半正定矩阵迹和正算子迹的一组不等式,得到与邱贤忠关于实数的不等式的类似结果.     

改善液晶光阀投影光学系统偏振特性的理论设计方法

定量分析了液晶光阀投影光学系统中影响系统对比度的主要因素，利用矢量方法建立三维空间数学模型对光线进行追迹，并利用琼斯矩阵和矢量光学的原理分析了偏振器件--主要是波片--和各种光学薄膜对光学系统性能的影响。给出了在一定假设条件下的对没有波片的光学系统和插入波征后的光学系统的仿真计算结果。两组数据比较表明在光路中插入合适相位差的波片可以显著提高系统对比度等性能。     

矩阵特征值的几个不等式

研究矩阵特征值的上、下界以及特征值的实部、虚部的不等式 ,给出了特征值一些新的上界和下界     

Concerning seven and eight mutually orthogonal Latin squares

In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc.     

GA optimization on multi-segments muffler under space constraints

Whilst the space volume of muffler in noise control system is often constrained for maintenance in practical engineering work, the maximization on muffler’s performance becomes important and essential. In this paper, a novel approach genetic algorithms (GAs) based on the principles of natural biological evolution will be used to tackle this optimization of muffler design [M. Mitchell, An Introduction to Genetic Algorithms, The MIT Press, Cambridge, MA, 1996]. Here, the shape optimization of multi-segments muffler coupled with the GA searching technique is presented. The techniques of binary genetic algorithms (BGA) together with the commercial MATLAB package [G. Lindfield, J. Penny, Numerical Method Using Matlab, second ed., Prentice Hall, Englewood Cliffs, NJ, 2000] are applied in GA searching. In addition, a numerical case of pure tone elimination with 2-5 segments on muffler is introduced and fully discussed. To achieve the best optimization in GA, several GA parameters are on trial in various values. Results show that the GA operators, including crossover mutation and elitism, are essential in accuracy. Consequently, results verify that the optimal sound transmission loss at the designed frequency of 500 Hz is exactly maximized. The GA optimization on multi-segments muffler proposed in this study surely provides a quick and correct approach.     

Finite-Dimensional PT-Symmetric Hamiltonians

This paper investigates finite-dimensional PT-symmetric Hamiltonians. It is shown here that there are two ways to extend real symmetric Hamiltonians into the complex domain: (i) The usual approach is to generalize such Hamiltonians to include complex Hermitian Hamiltonians. (ii) Alternatively, one can generalize real symmetric Hamiltonians to include complex PT-symmetric Hamiltonians. In the first approach the spectrum remains real, while in the second approach the spectrum remains real if the PT symmetry is not broken. Both generalizations give a consistent theory of quantum mechanics, but if D>2, a D-dimensional Hermitian matrix Hamiltonian has more arbitrary parameters than a D-dimensional PT-symmetric matrix Hamiltonian.     

标度系统一致性矩阵容量的计算方法

本文研究正互反矩阵的变换性质 ,提出一种保持正互反矩阵一致性程度的等价分类 ,为计算各种标度系统下的一致矩阵容量提供了计算方法     

Large deviation for the empirical eigenvalue density of truncated Haar unitary matrices

Let U_m be an m×m Haar unitary matrix and U_[m,n] be its n×n truncation. In this paper the large deviation is proven for the empirical eigenvalue density of U_[m,n] as m/n→λ and n→∞. The rate function and the limit distribution are given explicitly. U_[m,n] is the random matrix model of quq, where u is a Haar unitary in a finite von Neumann algebra, q is a certain projection and they are free. The limit distribution coincides with the Brown measure of the operator quq.